An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
نویسندگان
چکیده
منابع مشابه
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
We propose a method for finding the efficient set of a multiple objective linear program based on the well-known facial decomposition of the efficient set. The method incorporates a simple linear programming test that identifies efficient faces while employing a top--down search strategy which avoids enumeration of efficient extreme points and locates the maximally efficient faces of the feasib...
متن کاملOn duality in multiple objective linear programming
We discuss two approaches to duality for multiple objective linear problems. The first approach is based on a duality relation between a set and its complement in the outcome space. It allows us to obtain a number of known duality constructions. The second approach utilizes polarity between a polyhedral set and the epigraph of its support function. It leads to a parametric dual problem which is...
متن کاملProviding a Method for Solving Interval Linear Multi-Objective Problems Based on the Goal Programming Approach
Most research has focused on multi-objective issues in its definitive form, with decision-making coefficients and variables assumed to be objective and constraint functions. In fact, due to inaccurate and ambiguous information, it is difficult to accurately identify the values of the coefficients and variables. Interval arithmetic is appropriate for describing and solving uncertainty and inaccu...
متن کاملMulti-objective optimization design of plate-fin heat sinks using an Evolutionary Algorithm Based On Decomposition
This article has no abstract.
متن کاملComputing efficient solutions to fuzzy multiple objective linear programming problems
In this paper, we improve the fuzzy compromise approach of Guu and Wu by automatically computing proper membership thresholds instead of choosing them. Indeed, in practice, choosing membership thresholds arbitrarily may result in an infeasible optimization problem. Although we can adjust minimum satisfaction degree to get fuzzy efficient solution, it sometimes makes the process of interactionmo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 1996
ISSN: 0167-6377
DOI: 10.1016/0167-6377(95)00046-1